Approximate Common Structures in XML Schema Matching1
نویسندگان
چکیده
This paper describes a matching algorithm that can find accurate matches and scales to large XML Schemas with hundreds of nodes. We model XML Schemas as labeled, unordered and rooted trees, and turn the schema matching problem into a tree matching problem. We develop a tree matching algorithm based on the concept of Approximate Common Structures. Compared with the tree edit-distance algorithm and other Schema matching systems, our algorithm is faster and more suitable for large XML Schema matching.
منابع مشابه
1 st Reading
XML Schema matching problem can be formulated as follows: given two XML Schemas, find the best mapping between the elements and attributes of the schemas, and the 19 overall similarity between them. XML Schema matching is an important problem in data integration, schema evolution, and software reuse. This paper describes a matching 21 system that can find accurate matches and scales to large XM...
متن کاملImproving Real World Schema Matching with Decomposition Process
This paper tends to provide an answer to a difficult problem: Matching large XML schemas. Scalable Matching acquires a long execution time other than decreasing the quality of matches. In this paper, we propose an XML schema decomposition approach as a solution for large schema matching problem. The presented approach identifies the common structures between and within XML schemas, and decompos...
متن کاملThe carbohydrate sequence markup language (CabosML): an XML description of carbohydrate structures
UNLABELLED Bioinformatics resources for glycomics are very poor as compared with those for genomics and proteomics. The complexity of carbohydrate sequences makes it difficult to define a common language to represent them, and the development of bioinformatics tools for glycomics has not progressed. In this study, we developed a carbohydrate sequence markup language (CabosML), an XML descriptio...
متن کاملConstruction of Verified Models for Systems Construction of Verified Models for Systems Represented as Networks
This paper presents both a language and process for producing verified models for systems that can be described as network structures. Analysing technical systems with interrelated components, a common data model for technical networks was elaborated and represented formally by UML. The UML model was transformed to XML and specified by means of XML Schema. The developed set of XML Schema docume...
متن کاملTest::XML::Generator Generating XML for Unit Testing
To define a DTD or a Schema is not a trivial task. It can be compared to the task of preparing a data structure or, in some cases, to program that data structure adding some semantic. This makes this task error prone. It is common that a final Schema/DTD supports some special XML structures that should not be considered correct, or that, although these special structures are correct, they are n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005